Tiara: A self-stabilizing deterministic skip list and skip graph
نویسندگان
چکیده
منابع مشابه
Tiara: A self-stabilizing deterministic skip list and skip graph
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.
متن کاملTiara: A Self-stabilizing Deterministic Skip List
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and updates and it stabilizes in linear time. It is based on sparse 0-1 skip list. We rigorously prove the algorithm correct in the shared register model. We then describe its refinement to the messa...
متن کاملCorona: A Stabilizing Deterministic Message-Passing Skip List
We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing str...
متن کاملA skip list for multicore
In this paper, we introduce the Rotating skip list, the fastest concurrent skip list to date. Existing concurrent data structures experience limited scalability with the growing core count for two main reasons: threads contend while accessing the same shared data and they require off-chip communication to synchronize. Our solution combines the rotation of a tree to maintain logarithmic complexi...
متن کاملAnalysis of a new skip list variant
Skip lists were introduced by Pugh (10) and analysed in (7; 4; 9) and also some other papers. We assume that the reader has a certain familiarity with skip lists, if (s)he wants to understand the origin of the problem. To understand the analysis that we perform, no such prerequisites are necessary. The variation that was suggested in (1) is best understood looking at the following example, take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.12.079